DFRFT based on the eigen decomposition of the DFT matrix, a DFRFT with one fractional parameter was defined by taking fractional eigen value powers of an eigen decomposition of the DFT matrix. The DFT eigenvectors
نویسنده
چکیده
886 Abstract— Growing with the fast evolution of digital data exchange, security information becomes much important in data storage and transmission. Due to the increasing use of images in industrial process, it is essential to protect the confidential image data from unauthorized access. The security system based on the fractional Fourier transform (FRFT) is protected by only a certain order of FRFT. In this paper, we proposed a novel method to encrypt an image by using Discrete Fourier Transform (DFT) and Fractional Fourier Transform (FRFT). In this paper, we analyze the image encryption using DFT and FRFT based on double random phase matrix. The implementation of both techniques has been realized for experimental purposes. Detailed results in terms of security analysis and implementation are given. Comparative study with traditional encryption algorithms is shown the superiority. The proposed encoding scheme significantly enhances the data security in comparatively than DFT and FRFT.
منابع مشابه
A novel method for discrete fractional Fourier transform computation
Fractional Fourier transform (FRFT) is a generalization of Fourier transform, and it indicates a rotation of signal in the time-frequency plane[l). The FRFT has been widely successfully used in the many areas[l][2]. Because of the importance of FRFT, discrete fractional Fourier transform (DFRFT) becomes an important issue in recent years[3][4] [5][6]. In the development of DFRFT, the DFRFT has ...
متن کاملThe discrete fractional Fourier transform based on the DFT matrix
We introduce a new discrete fractional Fourier transform (DFrFT) based on only the DFT matrix and its powers. Eigenvectors of the DFT matrix are obtained in a simple-yetelegant and straightforward manner. We show that this DFrFT definition based on the eigentransforms of the DFT matrix mimics the properties of continuous fractional Fourier transform (FrFT) by approximating the samples of the co...
متن کاملA new discrete fractional Fourier transform based on constrained eigendecomposition of DFT matrix by Largrange multiplier method
This paper is concerned with the definition of the discrete fractional Fourier transform (DFRFT). First, an eigendecomposition of the discrete Fourier transform (DFT) matrix is derived by sampling the Hermite Gauss functions which are eigenfunctions of the continuous Fourier transform and by performing a novel error removal procedure. Then, the result of the eigendecomposition of the DFT matrix...
متن کاملThe discrete fractional cosine and sine transforms
This paper is concerned with the definitions of the discrete fractional cosine transform (DFRCT) and the discrete fractional sine transform (DFRST). The definitions of DFRCT and DFRST are based on the eigen decomposition of DCT and DST kernels. This is the same idea as that of the discrete fractional Fourier transform (DFRFT); the eigenvalue and eigenvector relationships between the DFRCT, DFRS...
متن کاملDiscrete fractional Fourier transform based on the eigenvectors of tridiagonal and nearly tridiagonal matrices
The recent emergence of the discrete fractional Fourier transform (DFRFT) has caused a revived interest in the eigenanalysis of the discrete Fourier transform (DFT) matrix F with the objective of generating orthonormal Hermite-Gaussian-like eigenvectors. The Grünbaum tridiagonal matrix T – which commutes with matrix F – has only one repeated eigenvalue with multiplicity two and simple remaining...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013